сложность связей
—
[http://slovarionline.ru/anglo_russkiy_slovar_neftegazovoy_promyishlennosti/]
Англо-русский словарь нормативно-технической терминологии. academic.ru. 2015.
Complexity — For other uses, see Complexity (disambiguation). In general usage, complexity tends to be used to characterize something with many parts in intricate arrangement. The study of these complex linkages is the main goal of complex systems theory. In… … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
Model of Hierarchical Complexity — The model of hierarchical complexity is a framework for scoring how complex a behavior is. It quantifies the order of hierarchical complexity of a task based on mathematical principles of how the information is organized and of information… … Wikipedia
SNP (complexity) — In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logical characterization in terms of graph theoretical properties. It forms the basis for the definition of the class… … Wikipedia
Irreducible complexity — This article covers irreducible complexity as used by those who argue for intelligent design. For information on irreducible complexity as used in Systems Theory, see Irreducible complexity (Emergence). Irreducible complexity (IC) is an argument… … Wikipedia
Model of hierarchical complexity — The model of hierarchical complexity, is a framework for scoring how complex a behavior is. It quantifies the order of hierarchical complexity of a task based on mathematical principles of how the information is organized and of information… … Wikipedia
RE (complexity) — In computability theory and computational complexity theory, RE (recursively enumerable) is the class of decision problems for which a yes answer can be verified by a Turing machine in a finite amount of time.[1] Informally, it means that if the… … Wikipedia
Descriptive complexity theory — For other uses, see Kolmogorov complexity. Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic needed to express the languages in them. For… … Wikipedia
Descriptive complexity — is a branch of finite model theory, a subfield of computational complexity theory and mathematical logic, which seeks to characterize complexity classes by the type of logic needed to express the languages in them. For example, PH, the union of… … Wikipedia
Social identity complexity — Social Identity Complexity: Who is We ? Given the recognition that individuals belong to multiple social groups, with multiple corresponding social identities, an important question to be addressed is how individuals combine these group… … Wikipedia
History of foreign relations of the People's Republic of China — Main article: Foreign relations of the People s Republic of China Since the early 1980s China has pursued a highly independent foreign policy, formally disavowing too close a relationship with any country or region. The stated goals of this… … Wikipedia
